Competitive Boolean function evaluation: Beyond monotonicity, and the symmetric case

Competitive Boolean Function Evaluation: Beyond Monotonicity, and the Symmetric Case

We study the extremal competitive ratio of Boolean function evaluation. We provide the first non-trivial lower and upper bounds for classes of Boolean functions which are not included in the class of monotone Boolean functions. For the particular case of symmetric functions our bounds are matching and we exactly characterize the best possible competitiveness achievable by a deterministic algori...

Stochastic Evaluation of Symmetric Boolean Functions

Monotonicity , Convexity and Symmetric Derivates

If the first lower symmetric derívate of a continuous function is nonnegative, then it is nondecreasing. If the second lower symmetric derívate of a continuous function is nonnegative, then it is convex. In this paper it is shown that if continuity is replaced by Baire one, Darboux in each of these, then the resulting statements are true.

Testing k-Monotonicity (The Rise and Fall of Boolean Functions)

A Boolean k-monotone function defined over a finite poset domain D alternates between the values 0 and 1 at most k times on any ascending chain in D. Therefore, k-monotone functions are natural generalizations of the classical monotone functions, which are the 1-monotone functions. Motivated by the recent interest in k-monotone functions in the context of circuit complexity and learning theory,...

Boolean Searchable Symmetric Encryption with Worst-Case Sub-linear Complexity

Recent work on searchable symmetric encryption (SSE) has focused on increasing its expressiveness. A notable example is the OXT construction (Cash et al., CRYPTO ’13 ) which is the first SSE scheme to support conjunctive keyword queries with sub-linear search complexity. While OXT efficiently supports disjunctive and boolean queries that can be expressed in searchable normal form, it can only h...